An Improved Subgradiend Optimization Technique for Solving IPs with Lagrangean Relaxation
نویسندگان
چکیده
منابع مشابه
An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملA Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems
Industrial & Engineering Chemistry Research is published by the American Chemical Society. 1155 Sixteenth Street N.W., Washington, DC 20036 Article A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems Anshuman Gupta, and Costas D. Maranas Ind. Eng. Chem. Res., 1999, 38 (5), 1937-1947• DOI: 10.1021/ie980782t • Publication Date (Web): 26 March 1999 Downloaded from ...
متن کاملAn improved Lagrangean relaxation algorithm for the dynamic batching decision problem
This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan, sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملAn Improved Particle Swarm Optimization Technique for Solving the Unit Commitment Problem
Automation of power system nowadays is one of the great spreading fields in electrical engineering. Artificial Intelligence Technique helps in developing and modifying the automated power system. The particle swarm optimization (PSO) technique is one of the recent artificial intelligent techniques. In this thesis a modified particle swarm optimization (MPSO) is utilized in Unit Commitment Probl...
متن کاملLagrangean/surrogate relaxation for generalized assignment problems
This work presents Lagrangean/surrogate relaxation to the problem of maximum pro®t assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. The Lagrangean/surrogate relaxation combines usual Lagrangean and surrogate relaxations relaxing ®rst a set of constraints in the surrogate way. Then, the Lagrangean relaxati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dhaka University Journal of Science
سال: 2013
ISSN: 2408-8528,1022-2502
DOI: 10.3329/dujs.v61i2.17059